On the b-chromatic number of Kneser graphs
نویسنده
چکیده
In this note, we prove that for any integer n ≥ 3 the b-chromatic number of the Kneser graph KG(m,n) is greater than or equal to 2 ( ⌊m 2 ⌋
منابع مشابه
On the Edge-Difference and Edge-Sum Chromatic Sum of the Simple Graphs
For a coloring $c$ of a graph $G$, the edge-difference coloring sum and edge-sum coloring sum with respect to the coloring $c$ are respectively $sum_c D(G)=sum |c(a)-c(b)|$ and $sum_s S(G)=sum (c(a)+c(b))$, where the summations are taken over all edges $abin E(G)$. The edge-difference chromatic sum, denoted by $sum D(G)$, and the edge-sum chromatic sum, denoted by $sum S(G)$, a...
متن کاملCircular chromatic number of Kneser graphs
This paper proves that for any positive integer n, if m is large enough, then the reduced Kneser graph KG2(m, n) has its circular chromatic number equal its chromatic number. This answers a question of Lih and Liu [J. Graph Theory, 2002]. For Kneser graphs, we prove that if m ≥ 2n2(n − 1), then KG(m, n) has its circular chromatic number equal its chromatic number. This provides strong support f...
متن کاملLocal chromatic number and the Borsuk-Ulam Theorem
The local chromatic number of a graph was introduced in [13]. It is in between the chromatic and fractional chromatic numbers. This motivates the study of the local chromatic number of graphs for which these quantities are far apart. Such graphs include Kneser graphs, their vertex color-critical subgraphs, the stable Kneser (or Schrijver) graphs; Mycielski graphs, and their generalizations; and...
متن کاملRandom Kneser graphs and hypergraphs
A Kneser graph KGn,k is a graph whose vertices are all k-element subsets of [n], with two vertices connected if and only if the corresponding sets do not intersect. A famous result due to Lovász states that the chromatic number of a Kneser graph KGn,k is equal to n − 2k + 2. In this paper we discuss the chromatic number of random Kneser graphs and hypergraphs. It was studied in two recent paper...
متن کاملCircular chromatic numbers of some reduced Kneser graphs
The vertex set of the reduced Kneser graph KG2(m, 2) consists of all pairs {a, b} such that a, b ∈ {1, 2, . . . ,m} and 2 ≤ |a−b| ≤ m−2. Two vertices are defined to be adjacent if they are disjoint. We prove that, if m ≥ 4 and m 6= 5, then the circular chromatic number of KG2(m, 2) is equal to m − 2, its ordinary chromatic number.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Applied Mathematics
دوره 158 شماره
صفحات -
تاریخ انتشار 2010